Computational Complexity of Point Algebras for Nonlinear Time
نویسنده
چکیده
E cient reasoning about temporal constraints over nonlinear time models is vital in numerous application areas, such as planning, distributed systems and cooperating agents. We give a total classi cation of tractable classes for the point algebra over partially ordered time and examine one large tractable subclass of the point algebra over branching time.
منابع مشابه
Fixed point theorems for generalized quasi-contractions in cone $b$-metric spaces over Banach algebras without the assumption of normality with applications
In this paper, we introduce the concept of generalized quasi-contractions in the setting of cone $b$-metric spaces over Banach algebras. By omitting the assumption of normality we establish common fixed point theorems for the generalized quasi-contractions with the spectral radius $r(lambda)$ of the quasi-contractive constant vector $lambda$ satisfying $r(lambda)in [0,frac{1}{s})$ in the set...
متن کاملA Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs
An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and proved. Moreover, we obtain a polynomial time complexity bound which matches the currently best known iteration bound for infeasible interior-point ...
متن کاملControlling Nonlinear Processes, using Laguerre Functions Based Adaptive Model Predictive Control (AMPC) Algorithm
Laguerre function has many advantages such as good approximation capability for different systems, low computational complexity and the facility of on-line parameter identification. Therefore, it is widely adopted for complex industrial process control. In this work, Laguerre function based adaptive model predictive control algorithm (AMPC) was implemented to control continuous stirred tank rea...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملApplication of endurance time method in damage assessment of concrete moment frames
Nonlinear Time History (NTH) analysis is currently the most reliable method for estimating structural behavior. Considerable computational demand and complexity of this method may cause difficulty for its routine practical application. Based on the Methodology of Endurance Time (ET) method, it can estimate the nonlinear response of structures with a much lower computational cost. In this resear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000